Optimizing error of high-dimensional statistical queries under differential privacy
نویسندگان
چکیده
منابع مشابه
Optimizing Histogram Queries under Differential Privacy
Differential privacy is a robust privacy standard that hasbeen successfully applied to a range of data analysis tasks.But despite much recent work, optimal strategies for answer-ing a collection of related queries are not known.We propose the matrix mechanism, a new algorithm foranswering a workload of predicate counting queries. Givena workload, the mechanism requests a...
متن کاملLow-Rank Mechanism: Optimizing Batch Queries under Differential Privacy
Differential privacy is a promising privacy-preserving paradigm for statistical query processing over sensitive data. It works by injecting random noise into each query result, such that it is provably hard for the adversary to infer the presence or absence of any individual record from the published noisy results. The main objective in differentially private query processing is to maximize the...
متن کاملLow Rank Mechanism for Optimizing Batch Queries under Differential Privacy
Differential privacy is a promising privacy-preserving paradigm for statistical query processing over sensitive data. It works by injecting random noise into each query result, such that it is provably hard for the adversary to infer the presence or absence of any individual record from the published noisy results. The main objective in differentially private query processing is to maximize the...
متن کاملOn Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimization of the query processing, accurate models for estimating the query processing costs are needed. In this paper, we propose a new cost model for nearest neighbor queries in high-dimensional space, which we apply to enhance t...
متن کاملOn Optimizing Nearest Neighbor Queries in High-Dimensional Spaces
Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimization of the query processing, accurate models for estimating the query processing costs are needed. In this paper, we propose a new cost model for nearest neighbor queries in high-dimensional space, which we apply to enhance t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2018
ISSN: 2150-8097
DOI: 10.14778/3231751.3231769